Minimizing the number of operations in DSP computations
نویسندگان
چکیده
Reduction of the number of operations optimizes the important design metrics such as area, cost, throughput, and power consumption for both custom ASIC and programmable processor implementations. We propose a novel technique to minimize the number of operations in DSP computations. The rst step of the approach logically partitions a computation into strongly connected components. The second step optimizes each component separately. In the third step the components are merged to further optimize. Finally, the components are scheduled to minimize memory consumption. The e ectiveness of our approach is demonstrated on real-life examples.
منابع مشابه
Overlapped Scheduling Techniques for High-level Synthesis and Multiprocessor Realizations of Dsp Algorithms
Algorithms that contain computations that can be executed simultaneously, offer possibilities of exploiting the parallelism present by implementing them on appropriate hardware, such as a multiprocessor system or an application-specific integrated circuit (ASIC). Many digital signal processing (DSP) algorithms contain internal parallelism and are besides meant to be repeated infinitely (or a la...
متن کاملNumerical Error Minimizing Floating-Point to Fixed-Point ANSI C Compilation
This paper presents an ANSI C floating-point to fixed-point conversion capability currently being integrated within an application specific processor architecture/compiler co-development project at the University of Toronto. The conversion process utilizes profiling data to capture the dynamic range of floating-point variables and intermediate calculations to guide in the generation of scaling ...
متن کاملSimultaneous Optimization of Delay and Number of Operations in Multiplierless Implementation of Linear Systems
The problem of implementing linear systems in hardware by efficiently using shifts and additions instead of multiplications has been actively researched in the past. Most of the works have concentrated on reducing the number of operations by using different techniques for redundancy elimination and have not considered their effect on the delay of the transformed computations. In this paper, we ...
متن کاملSolving single facility goal Weber location problem using stochastic optimization methods
Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...
متن کاملHomogeneous VLSI structures for high speed digital signal processing using number theoretic techniques
Exact computations, performed with residues, occur in Number Theoretic Transforms and Residue Number System implementations. Once thought awkward to implement with standard logic circuits, the application of efficient small lookup tables, constructed with pipelined dynamic ROM's, allows very efficient construction of hardware ideally suited to residue operations. Linear DSP operations that are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997